Job Auctions ∗
نویسنده
چکیده
This paper proposes job auctions as a theory of wage determination in models of labor markets with search frictions. Workers apply for jobs by bidding in auctions, and firms reward the job to the applicant who offers it the most profit. In equilibrium, more productive applicants always outbid less productive ones, but the threat of competition holds down the former’s wage demand. The equilibrium of the job auction model is always efficient, in contrast to standard search models. The model produces a distinctive and empirically testable relationship between the wage-productivity schedule, the unemployment-productivity schedule, and the underlying labor productivity distribution. The model also predicts that the minimum wage will have a ripple effect on workers for whom it is not binding, by reducing the competition from less productive workers. ∗This paper is a substantial revision of the second chapter of my MIT Ph.D. dissertation, “Do Good Guys Come in First? How Wage Determination Affects The Ranking of Job Applicants”. I am grateful to numerous individuals and seminar participants for their helpful comments and discussions. Thanks in particular to my thesis advisors Daron Acemoglu and Olivier Blanchard. I also thank the Alfred P. Sloan Foundation and National Science Foundation grant SBR-9709881 for financial support. Job Auctions Robert Shimer
منابع مشابه
A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملPrice Updating in Combinatorial Auctions for Coordination of Manufacturing Multiagent Systems
In this work we use the paradigm of multiagent systems to solve the Job Shop problem. Job Shop problem is a particular problem of scheduling in which we try to find an schedule that optimize a objective and is subject to certain constraints. We propose a combinatorial auction mechanism to coordinate agents. The “items” to be sold are the time slots that we divide the time horizon into. In tasks...
متن کاملProcurement Auctions with Pre-award Subcontracting
To be the lowest bidders in procurement auctions, contractors commonly solicit subcontract bids at the bid preparation stage. A remarkable feature of the subcontract competition is that “winning is not everything”; the lowest subcontractor gets a job conditional on his contractor’s successful bid. This paper makes the first attempt to establish a model for such pre-award subcontract competition...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملGrid Computing for Solving the Optimal Winner Determination Problem
Grid computing is a recent technology that has become extremely popular to optimize computing resources and manage data and computing workloads. In this paper, we present a parallel genetic algorithm improved by using a stochastic local search for solving the optimal winner determination problem (WDP) in combinatorial auctions. We give also a parallel implementation of the proposed approach on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999